Low-degree permutation rational functions over finite fields
نویسندگان
چکیده
We determine all degree-$4$ rational functions $f(X)\in \mathbb {F}_q(X)$ which permute $\mathbb {P}^1(\mathbb {F}_q)$, and answer two questions of Ferraguti Micheli about the number such equivalence classes func
منابع مشابه
Enumerating permutation polynomials over finite fields by degree II
This note is a continuation of a paper by the same authors that appeared in 2002 in the same journal. First we extend the method of the previous paper proving an asymptotic formula for the number of permutations for which the associated permutation polynomial has d coefficients in specified fixed positions equal to 0. This also applies to the function Nq,d that counts the number of permutations...
متن کاملEnumerating Permutation Polynomials over Finite Fields by Degree
fσ has the property that fσ(a) = σ(a) for every a ∈ Fq and this explains its name. For an account of the basic properties of permutation polynomials we refer to the book of Lidl and Niederreiter [5]. From the definition, it follows that for every σ ∂(fσ) ≤ q − 2. A variety of problems and questions regarding Permutation polynomials have been posed by Lidl and Mullen in [3, 4]. Among these there...
متن کاملPermutation Binomials over Finite Fields
We prove that if xm + axn permutes the prime field Fp, where m > n > 0 and a ∈ Fp, then gcd(m − n, p − 1) > √ p − 1. Conversely, we prove that if q ≥ 4 and m > n > 0 are fixed and satisfy gcd(m − n, q − 1) > 2q(log log q)/ log q, then there exist permutation binomials over Fq of the form xm + axn if and only if gcd(m,n, q − 1) = 1.
متن کاملThe Art of Iterating Rational Functions over Finite Fields
The field of complex dynamical systems generated by iteration of polynomials and rational functions is a classical area of mathematics with a rich history and a wide variety of results. Recently, there has been substantial interest in arithmetical dynamical systems (ADS), meaning the iteration of rational functions over fields of number-theoretic interest. Although isolated results regarding AD...
متن کاملSome New Permutation Polynomials over Finite Fields
In this paper, we construct a new class of complete permutation monomials and several classes of permutation polynomials. Further, by giving another characterization of opolynomials, we obtain a class of permutation polynomials of the form G(x) + γTr(H(x)), where G(X) is neither a permutation nor a linearized polynomial. This is an answer to the open problem 1 of Charpin and Kyureghyan in [P. C...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Arithmetica
سال: 2022
ISSN: ['0065-1036', '1730-6264']
DOI: https://doi.org/10.4064/aa210521-12-11